Due time driven surgery scheduling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blocking Probability with Time-driven Priority Scheduling

This paper provides a methodology for evaluating call blocking probability over packet-switched networks with Time-driven priority (TDP) [4][5] and obtained results. The approach presented in this work is novel, since call blocking is typically studied in the context of circuit-switched networks. TDP together with resource reservation enable real-time delivery of packets with no loss due to con...

متن کامل

A Time-Driven Scheduling Model for Real-Time Operating Systems

Process scheduling in real-time systems has almost invariably used one or more of three algorithms: fixed priority, FIFO, or round robin. The reasons for these choices are simplicity and speed in the operating system, but the cost to the system in terms of reliability and maintainability have not generally been assessed. This paper originates from the notion that the primary distinguishing char...

متن کامل

Scheduling for Flexible Package Production Minimising Due Time Violations

This paper includes part of the strategies used to solve a scheduling problem developed for a company that produces flexible packaging. In this problem it is necessary to schedule several jobs that involve four processes and for each there is a group of machines available with similar characteristics. Each activity is performed on just one machine. The scheduling must also try to verify certain...

متن کامل

Single-machine scheduling with waiting-time-dependent due dates

We consider a single-machine scheduling problem in which due dates are linear functions of the job waiting-times and the objective is to minimize the maximum lateness. An optimal sequence is constructed by implementing an index-based priority rule for a fixed value of the due date normalizing constant k. We determine in polynomial time all the k value ranges so that the optimal sequence remains...

متن کامل

Flexibility Driven Scheduling and Mapping for Distributed Real-Time Systems

In this paper we present an approach to mapping and scheduling of distributed hard real-time systems, aiming at improving the flexibility of the design process. We consider an incremental design process that starts from an already existing system running a set of applications, with preemptive priority based scheduling at the process level, and time triggered static scheduling at the communicati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Health Care Management Science

سال: 2016

ISSN: 1386-9620,1572-9389

DOI: 10.1007/s10729-016-9356-4